Matching Code-on-Graph with Network-on-Graph: Adaptive Network Coding for Wireless Relay Networks
نویسندگان
چکیده
We consider user cooperation in a wireless relay network that comprises a collection of transmitters sending data to a common receiver through inherently unreliable and constantly changing channels. Exploiting the recently developed technology of network coding, we propose a new framework, termed adaptive network coded cooperation (ANCC), as a practical, de-centralized, adaptive and efficient cooperative strategy for large-scale wireless networks. The key idea is to match network-on-graph, i.e. the instantaneous network topology described in graph, with the wellknown class of codes-on-graph, i.e. low-density parity-check (LDPC) codes and LDPC-like codes, to combat the lossy nature of wireless links and to adapt to the changing network topology. We demonstrate, through several ensembles of low-density generator matrix (LDGM) codes and lowertriangular LDPC codes, that the proposed framework can considerably increase the cooperation level and reduce the outage rate. Huge gains of some 20-40 dBs are achieved over the conventional repetition schemes! Index Terms User cooperation, relay networks, network coding, code-on-graph, low-density parity-check (LDPC) codes, low-density generator-matrix (LDGM) codes
منابع مشابه
Feedback-based adaptive network coded cooperation for wireless networks
A novel feedback-based adaptive network coded cooperation (FANCC) scheme is proposed for wireless networks that comprise a number of terminals transmitting data to a common destination. The proposed FANCC exploits network coding and matches code-on-graph with network-on-graph, which is a substantial extension of adaptive network coded cooperation (ANCC). In the relay phase of FANCC, the termina...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملPower Allocation Strategies in Block-Fading Two-Way Relay Networks
This paper aims at investigating the superiority of power allocation strategies, based on calculus of variations in a point-to-point two-way relay-assisted channel incorporating the amplify and forward strategy. Single and multilayer coding strategies for two cases of having and not having the channel state information (CSI) at the transmitters are studied, respectively. Using the notion of cal...
متن کاملRateless Coding over Wireless Relay Networks Using Amplify/Decode and Forward Relays
In this paper two different rateless transmissionschemes are developed. In the proposed scheme, relay node candecode and forward the message to the destination if they areable to decode it, or amplify and forward the message to thedestination. Based on the analysis and simulation resultsprovided in this paper, the proposed method has bettertransmission time than the scheme which only the relay ...
متن کاملظرفیت شبکه های حذفی تحت کدینگ فضایی شبکه
We study the capacity of point-to-point erasure networks under a restricted form of network coding to which we refer as spatial network coding. In this form of coding, the nodes can not perform coding on successive packets which are received from one incoming link. The coding at a node is restricted to the packets received at the same time slot from different incoming links...
متن کامل